The Speedup-Test: a statistical methodology for programme speedup analysis and computation
نویسندگان
چکیده
منابع مشابه
The Speedup-Test: a statistical methodology for programme speedup analysis and computation
In the area of high performance computing and embedded systems, numerous code optimisation methods exist to accelerate the speed of the computation (or optimise another performance criteria). They are usually experimented by doing multiple observations of the initial and the optimised execution times of a program in order to declare a speedup. Even with fixed input and execution environment, pr...
متن کاملThe Speedup Test
Numerous code optimisation methods are usually experimented by doing multiple observations of the initial and the optimised executions times in order to declare a speedup. Even with fixed input and execution environment, programs executions times vary in general. So hence different kinds of speedups may be reported: the speedup of the average execution time, the speedup of the minimal execution...
متن کاملSuperlinear Speedup in Parallel Computation
Speedup of a parallel computation is defined as Sp = T/Tp [2], where T is the sequential time of a problem and Tp is the parallel time to solve the same problem using p processors. Tp was argued to be no greater than P in [3]. However, in practice, people observed “superlinear speedup”, i.e. the speedup with P processors is greater than P. Two main reasons for superlinear speedup are shown in [...
متن کاملQuantum speedup in stoquastic adiabatic quantum computation
Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation have been investigated to show quantum computational supremacy. At a commercial side, quantum annealing machine realizes the quantum Ising model with a transver...
متن کاملA Formal Framework for Speedup
Speedup learning seeks to improve the computational eeciency of problem solving with experience. In this paper, we develop a formal framework for learning eecient problem solving from random problems and their solutions. We apply this framework to two diierent representations of learned knowledge, namely control rules and macro-operators, and prove theorems that identify suucient conditions for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Concurrency and Computation: Practice and Experience
سال: 2012
ISSN: 1532-0626
DOI: 10.1002/cpe.2939